Dither and data compression
نویسندگان
چکیده
This correspondence presents entropy analyses for dithered and undithered quantized sources. Two methods are discussed that reduce the increase in entropy caused by the dither. The first method supplies the dither to the lossless encoding-decoding scheme. It is argued that this increases the complexity of the encoding-decoding scheme. A method to reduce this complexity is proposed. The second method is the usage of a dead-zone quantizer. A procedure for determining the optimal dead-zone width in the mean-square sense is given.
منابع مشابه
Quantization Considerations for Distortion-Controlled Data Compression
Distortion-controlled data compression is lossy signal compression in which the amount of distortion introduced into any small portion of a signal is strictly limited. This article gives results on various practical aspects of quantization and distortioncontrolled compression. The primary focus is near-lossless compression, as accomplished by predictive techniques. For compression of noisy sign...
متن کاملQuantization watermarking
A watermarking scheme for distinguishing different copies of the same multimedia document (fingerprinting) is investigated. Efficient transmission of natural data requires lossy compression, which might impair the embedded watermark. We investigate whether the quantization step in compression schemes can be replaced by dithered quantization to combine fingerprinting and compression. Dithered qu...
متن کاملDither-modulation data hiding with distortion-compensation: exact performance analysis and an improved detector for JPEG attacks
The binary Distortion Compensated Dither-Modulation (DCDM), which can be regarded to as a baseline for quantizationbased data-hiding methods, is rigorously analyzed. A novel and accurate procedure for computing the exact probability of bit error is given, as well as an approximation amenable to differentiation which allows to obtain the optimal weights in a newly proposed decoding structure, fo...
متن کاملDither-based secure image hashing using distributed coding
We propose an image hashing algorithm that is based on distributed compression principles. The algorithm assumes the availability of a robust feature vector extracted from the image. Then a suitable dither sequence is added to this feature vector, and the resulting dithered feature vector is compressed using distributed compression principles. We prove that the dither sequence can be used to gu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 45 شماره
صفحات -
تاریخ انتشار 1997